#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;
int n, m;
int num[N];
int sum[N];

// 前缀和+二分
inline void solution() {
    cin >> n >> m;
    for (int i = 1; i <= n; i ++) {
        cin >> num[i - 1];
        sum[i] = sum[i - 1] + num[i - 1];
    }
    // for (int i = 0; i < n; i ++ ) cout << i << ":" << num[i] << endl;
    // cout << endl;
    // for (int i = 0; i <= n; i ++ ) cout << i << ":" <<  sum[i] << " ";
    // cout << endl;

    vector<pair<int, int> > res;
    int MIN = INF;
    for (int i = 1; i <= n; i ++ ) {
        int pos = lower_bound(sum, sum + n, sum[i - 1] + m) - sum;
        int diff = sum[pos] - sum[i - 1] - m;
        if (diff < MIN && diff >= 0) {
            MIN = diff;
            res.clear();
            res.push_back({i, pos});
            // cout << diff << endl;
        } else if (diff == MIN) 
            res.push_back({i, pos});
    }
    for (auto & x : res) cout << x.first << "-" << x.second << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}